3D Compression Made Simple: Edgebreaker on a Corner-Table

نویسندگان

  • Jarek Rossignac
  • Alla Safonova
  • Andrzej Szymczak
چکیده

* This material is based upon work supported by the National Science Foundation under Grant 9721358. Abstract Edgebreaker is a simple technique for compressing 3D triangle meshes. We introduce here a new formulation, which leads to a simple implementation. We describe it in terms of a data structure, the Corner Table, which represents the connectivity of any manifold triangle mesh as two table of integers. For meshes that are homeomorphic to a sphere, Edgebreaker encodes these two tables with less than 2 bits per triangle. It compresses vertex locations using a parallelogram predictor. Entropy encoding reduces this cost in practice to less than a bit per triangle when the mesh is large. The detailed compression and decompression algorithms fit on a page. Through minor modifications, the Edgebreaker algorithm has been adapted to manifold meshes with holes and handles, to nontriangle meshes, and to non-manifold meshes. A Corner-Table implementation of these extensions will be described elsewhere.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge breaker on a Corner T able: A simple technique for representing and compressing triangulated surfaces

A triangulated surface S with V vertices is sometimes stored as a list of T independen floating-point coordinates of its vertices. This representation requires about 576 information regarding the adjacency between neighboring triangles or vertices. A va structures may be derived from such a representation in order to make explicit the relations between triangles, edges, and vertices. These rela...

متن کامل

Edgebreaker: Compressing the incidence graph of triangle meshes

Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits to store the incidence graph of a mesh of n triangles. Edgebreaker requires only 2n bits or less for si...

متن کامل

Edgebreaker: Connectivity Compression for Triangle Meshes

Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. Edgebreaker improves upon the storage required by previously reported schemes, most of which can guarantee only an O(tlog(t)) storage cost for the incidence graph of a mesh of t triangles. Edgebreaker requires at most 2t bits for a...

متن کامل

Delphi Encoding: Improving Edgebreaker 3D Compression by Geometry based Connectivity Prediction

Delphi is a new geometry-guided predictive compression scheme for squeezing the connectivity of a triangluar mesh. The mesh is traversed using the Edgebreaker state machine. Instead of creating the Edgebreaker clers sequence both compression and decompression perform the same geometric prediction of the location of the unknown vertex of the next triangle during the mesh traversal. Based on this...

متن کامل

Guaranteed 3.67v bit encoding of planar triangle graphs

We present a new representation that is guaranteed to encode any planar triangle graph of V vertices in less than 3.67V bits. Our code improves on all prior solutions to this well studied problem and lies within 13% of the theoretical lower limit of the worst case guaranteed bound. It is based on a new encoding of the CLERS string produced by RossignacÕs Edgebreaker compression [Rossignac99]. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001